The Backpropagation Artificial Neural Network Based on Elite Particle Swam Optimization Algorithm for Stochastic Linear Bilevel Programming Problem
نویسندگان
چکیده
منابع مشابه
A Neural Network Approach for Solving Linear Bilevel Programming Problem
A neural network model is presented for solving nonlinear bilevel programming problem, which is a NP-hard problem. The proposed neural network is proved to be Lyapunov stable and capable of generating approximal optimal solution to the nonlinear bilevel programming problem. The asymptotic properties of the neural network are analyzed and the condition for asymptotic stability, solution feasibil...
متن کاملElite Opposition-based Artificial Bee Colony Algorithm for Global Optimization
Numerous problems in engineering and science can be converted into optimization problems. Artificial bee colony (ABC) algorithm is a newly developed stochastic optimization algorithm and has been widely used in many areas. However, due to the stochastic characteristics of its solution search equation, the traditional ABC algorithm often suffers from poor exploitation. Aiming at this weakness o...
متن کاملSolving Bilevel Multiobjective Programming Problem by Elite Quantum Behaved Particle Swarm Optimization
and Applied Analysis 3 min y f ( x, y ) s.t. g ( x, y ) ≥ 0, 2.1 where F x, y and f x, y are the upper level and the lower level objective functions, respectively. G x, y and g x, y denote the upper level and the lower level constraints, respectively. Let S { x, y | G x, y ≥ 0, g x, y ≥ 0}, X {x | ∃y, G x, y ≥ 0, g x, y ≥ 0}, S x {y | g x, y ≥ 0}, and for the fixed x ∈ X, let S X denote the wea...
متن کاملThe Artificial Neural Networks Based on Scalarization Method for a Class of Bilevel Biobjective Programming Problem
A two-stage artificial neural network (ANN) based on scalarization method is proposed for bilevel biobjective programming problem (BLBOP). The induced set of the BLBOP is firstly expressed as the set of minimal solutions of a biobjective optimization problem by using scalar approach, and then the whole efficient set of the BLBOP is derived by the proposed two-stage ANN for exploring the induced...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2018
ISSN: 1024-123X,1563-5147
DOI: 10.1155/2018/1626182